refutable - определение. Что такое refutable
Diclib.com
Словарь ChatGPT
Введите слово или словосочетание на любом языке 👆
Язык:

Перевод и анализ слов искусственным интеллектом ChatGPT

На этой странице Вы можете получить подробный анализ слова или словосочетания, произведенный с помощью лучшей на сегодняшний день технологии искусственного интеллекта:

  • как употребляется слово
  • частота употребления
  • используется оно чаще в устной или письменной речи
  • варианты перевода слова
  • примеры употребления (несколько фраз с переводом)
  • этимология

Что (кто) такое refutable - определение

PROPERTY OF A THEORY/HYPOTHESIS/STATEMENT THAT CAN BE LOGICALLY CONTRADICTED BY AN EMPIRICAL TEST OR A FACT
Falsifiable; Falsify; Unfalsifiable; Logic of falsification; Unfalsifiability; Un-testable hypothesis; Untestable hypothesis; Non-falsifiable; Falsifiablity; Falsifability; Falsifying; Falsified; Refutability; Falsifiably; Refutable; Refutably; Falsifiabilities; Refutabilities; Falsification (Falsifiability); Principle of falsification; Nonfalsifiable; Nonfalsifiability; Falsifiability principle; Untestability; Denied falsifiability; Dogmatic falsificationism; Naive falsificationism; Sophisticated falsificationism; Irrefutable; Popper's criterion
  • Here are two [[black swan]]s, but even with no black swans to possibly falsify it, "All swans are white" would still be shown falsifiable by "Here is a black swan"—a black swan would still be a state of affairs, only an imaginary one.<ref name=Popperonstateofaffairs group="upper-alpha"/>
  • 1956}})
Найдено результатов: 17
refutable         
In lazy functional languages, a refutable pattern is one which may fail to match. An expression being matched against a refutable pattern is first evaluated to head normal form (which may fail to terminate) and then the top-level constructor of the result is compared with that of the pattern. If they are the same then any arguments are matched against the pattern's arguments otherwise the match fails. An irrefutable pattern is one which always matches. An attempt to evaluate any variable in the pattern forces the pattern to be matched as though it were refutable which may fail to match (resulting in an error) or fail to terminate. Patterns in Haskell are normally refutable but may be made irrefutable by prefixing them with a tilde (refutable). For example, ( (x,y) -> 1) undefined ==> undefined ( refutable(x,y) -> 1) undefined ==> 1 Patterns in Miranda are refutable, except for tuples which are irrefutable. Thus g [x] = 2 g undefined ==> undefined f (x,y) = 1 f undefined ==> 1 Pattern bindings in local definitions are irrefutable in both languages: h = 1 where [x] = undefined ==> 1 Irrefutable patterns can be used to simulate unlifted products because they effectively ignore the top-level constructor of the expression being matched and consider only its components.
Refutable         
·adj Admitting of being refuted or disproved; capable of being proved false or erroneous.
irrefutable         
[?'r?fj?t?b(?)l, ??r?'fju:-]
¦ adjective impossible to deny or disprove.
Derivatives
irrefutability noun
irrefutably adverb
irrefutable         
a.
Indisputable, unanswerable. See irrefragable.
Refutability         
·noun The quality of being refutable.
irrefutable         
The opposite of refutable.
irrefutable         
Irrefutable evidence, statements, or arguments cannot be shown to be incorrect or unsatisfactory. (FORMAL)
The pictures provide irrefutable evidence of the incident...
= indisputable
ADJ
Irrefutable         
·adj Incapable of being refuted or disproved; indisputable.
Falsifiable         
·adj Capable of being falsified, counterfeited, or corrupted.
Falsified         
·Impf & ·p.p. of Falsify.

Википедия

Falsifiability

Falsifiability is a deductive standard of evaluation of scientific theories and hypotheses, introduced by the philosopher of science Karl Popper in his book The Logic of Scientific Discovery (1934). A theory or hypothesis is falsifiable (or refutable) if it can be logically contradicted by an empirical test.

Popper proposed falsifiability as the cornerstone solution to both the problem of induction and the problem of demarcation. He insisted that, as a logical criterion, falsifiability is distinct from the related concept "capacity to be proven wrong" discussed in Lakatos' falsificationism. Even being a logical criterion, its purpose is to make the theory predictive and testable, and thus useful in practice.

Popper contrasted falsifiability to the intuitively similar concept of verifiability that was then current in logical positivism. His argument goes that the only way to verify a claim such as "All swans are white" would be if one could theoretically observe all swans, which is not possible. Instead, falsifiability searches for the anomalous instance, such that observing a single black swan is theoretically reasonable and sufficient to logically falsify the claim. On the other hand, the Duhem–Quine thesis says that definitive experimental falsifications are impossible and that no scientific hypothesis is by itself capable of making predictions, because an empirical test of the hypothesis requires one or more background assumptions.

According to Popper there is a clean asymmetry on the logical side and falsifiability does not have the Duhem problem because it is a logical criterion. Experimental research has the Duhem problem and other problems, such as induction, but, according to Popper, statistical tests, which are only possible when a theory is falsifiable, can still be useful within a critical discussion. Philosophers such as Deborah Mayo consider that Popper "comes up short" in his description of the scientific role of statistical and data models.

As a key notion in the separation of science from non-science and pseudoscience, falsifiability has featured prominently in many scientific controversies and applications, even being used as legal precedent.